منابع مشابه
Discrete Rational Lp Approximation
In this paper, the problem of approximating a function defined on a finite subset of the real line by a family of generalized rational functions whose numerator and denominator spaces satisfy the Haar conditions on some closed interval [a, b] containing the finite set is considered. The pointwise closure of the family restricted to the finite set is explicitly determined. The representation obt...
متن کاملBest Basis Selection for Approximation in Lp
We study the approximation of a function class F in Lp by choosing first a basis B and then using n-term approximation with the elements of B. Into the competition for best bases we enter all greedy (i.e. democratic and unconditional [20]) bases for Lp. We show that if the function class F is well oriented with respect to a particular basis B then, in a certain sense, this basis is the best cho...
متن کاملk-Edge-Connectivity: Approximation and LP Relaxation
In the k-edge-connected spanning subgraph problem we are given a graph (V,E) and costs for each edge, and want to find a minimum-cost F ⊂ E such that (V, F ) is k-edge-connected. We show there is a constant ǫ > 0 so that for all k > 1, finding a (1 + ǫ)-approximation for k-ECSS is NP-hard, establishing a gap between the unit-cost and general-cost versions. Next, we consider the multi-subgraph c...
متن کاملLp approximation of Sigma-Pi neural networks
A feedforward Sigma-Pi neural network with a single hidden layer of m neurons is given by mSigma(j=1) cjg (nPi(k=1) xk-thetak(j)/lambdak(j)) where cj, thetak(j), lambdak are elements of R. In this paper, we investigate the approximation of arbitrary functions f: Rn-->R by a Sigma-Pi neural network in the Lp norm. An Lp locally integrable function g(t) can approximate any given function, if and ...
متن کاملArboral satisfaction: Recognition and LP approximation
A point set P is arborally satisfied if, for any pair of points with no shared coordinates, the box they span contains another point in P . At SODA 2009, Demaine, Harmon, Iacono, Kane, and Pǎtrascu proved a connection between the longstanding dynamic optimality conjecture about binary search trees and the problem of finding the minimum-size arborally satisfied superset of a given 2D point set [...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1972
ISSN: 0022-247X
DOI: 10.1016/0022-247x(72)90061-3